Optimization of a Search Engine for an Organized and Effective Browsing

نویسندگان

  • K. Kalaivani
  • K. Lavanya
  • Dr. S. Uma
چکیده

In web search applications, queries are submitted to search engines to represent the information needs of users. Discovering the number of diverse user search goals for a query and depicting each goal with some keywords automatically. In the existing work propose a novel approach to infer user search goals by analyzing search engine query logs. First propose a novel approach to infer user search goals for a query by clustering our proposed feedback sessions. Second we propose a novel optimization method to map feedback sessions to pseudo-documents which can efficiently reflect user information needs. In the end, we cluster these pseudo documents to infer user search goals and depict them with some keywords. In proposed system k means clustering algorithm is computationally difficult, in order to overcome the k means clustering problem, enhancement a Fuzzy c-means clustering (FCM) algorithm to group the pseudo documents and it also measure the similarity between the pseudo terms in the documents, it improves the feedback sessions results than the normal pseudo documents. The FCM algorithm divides pseudo documents data for dissimilar size cluster by using fuzzy systems. FCM choosing cluster size and central point depend on fuzzy model. The FCM clustering algorithm it congregate quickly to a local optimum or grouping of the pseudo documents in wellorganized wayAnnotation of the search results of the database we proposed a annotation based results. We used Automatic annotation approach that first aligns the data units on a result page into different groups such that the data in the same group have the same semantic results. Finally measures the clustering results classified average precision (CAP) to evaluate the performance of the restructured web search results. Keywords-pseudo-documents, k means clustering, Fuzzy c-means clustering (FCM), annotation,classified average precision (CAP)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LiveImage: Organizing Web Images by Relevant Concept

The images retrieved from conventional Web search engines are not normally well organized in a conceptually meaningful way. Users find it difficult to reformulate effective queries through browsing the retrieved images. This paper presents an approach that organizes the retrieved images with relevant concepts, which are generated automatically from a concept pool obtained from various online re...

متن کامل

The Effect of Valve Lift on In-Cylinder Flow, Performance and Emissions in a Turbocharged DI Diesel Engine

A computational optimization was performed for a direct-injection diesel engine using three-dimensional modeling. Fully transient CFD analyses of different valve profile strategies for the intake and compression strokes were performed to evaluate the effects on both engine performance and in-cylinder flow-field evolution. The turbulence model was used along with the second order linear upwin...

متن کامل

Optimizing question answering systems by Accelerated Particle Swarm Optimization (APSO)

One of the most important research areas in natural language processing is Question Answering Systems (QASs). Existing search engines, with Google at the top, have many remarkable capabilities. But there is a basic limitation (search engines do not have deduction capability), a capability which a QAS is expected to have. In this perspective, a search engine may be viewed as a semi-mechanized QA...

متن کامل

A New Search Engine Integrating Hierarchical Browsing and Keyword Search

The original Yahoo! search engine consists of manually organized topic hierarchy of webpages for easy browsing. Modern search engines (such as Google and Bing), on the other hand, return a flat list of webpages based on keywords. It would be ideal if hierarchical browsing and keyword search can be seamlessly combined. The main difficulty in doing so is to automatically (i.e., not manually) clas...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014